منابع مشابه
parallel network processing
ly, we consider an in-memory interface to cleanly separate the networking from the disk activity. This is equivalent to assuming that the server’s networking activity can be explicitly scheduled, in a manner that is independent from other server activity. Our results will apply to systems in which this is the case. We anticipate that in large-scale servers, independent network scheduling will b...
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملDag-Calculus: A Calculus for Parallel Computation
This appendix consists of two main parts: in the first, we prove correct the translations of parallel primitives into the dag calculus, in the second, we prove that the scheduling algorithm implements the rules of the dag calculus. Concretely, Appendix A provides auxiliary definitions and properties for the translations; Appendices B, C and D provide the proofs of translations of fork-join, asy...
متن کاملGemini: An Optical Interconnection Network for Parallel Processing
The Gemini interconnect is a dual technology (optical and electrical) interconnection network designed for use in tightlycoupled multicomputer systems. It consists of a circuit-switched optical data path in parallel with a packet-switched electrical control/ data path. The optical path is used for transmission of long data messages and the electrical path is used for switch control and transmis...
متن کاملA new fixed degree regular network for parallel processing
We propose a family of regular Cayley network graphs of degree three based on permutation groups for design of massively parallel systems. These graphs are shown to be based on the shuffle exchange operations, to have logarithmic diameter in the number of vertices, and to be maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2015
ISSN: 0163-5999
DOI: 10.1145/2825236.2825256